Innermost many-sorted term rewriting on GPUs
نویسندگان
چکیده
This article presents a way to implement many-sorted term rewriting on GPU. is done by letting the GPU repeatedly perform massively parallel evaluation of all subterms. Innermost experimentally compared with relaxed form innermost rewriting, and two different garbage collection mechanisms, remove terms that are no longer needed, discussed compared. It concluded when rewrite systems exhibit sufficient internal parallelism, substantially outperforms CPU. Both further improve this performance. Since implementation can probably be even optimised, because in any case GPUs will become much more powerful future, suggests an interesting platform for (many-sorted) rewriting. As viewed as universal programming language, also opens route towards especially irregular computations.
منابع مشابه
Currying of Order-Sorted Term Rewriting Systems
Term rewriting system is a helpful tool for implementing functional programming languages. We focus upon a transformation of term rewriting systems called currying. Currying transforms a term rewriting system with symbols of arbitrary arity into another one, which contains only nullary symbols with a single binary symbol called application. Currying in single-sorted case is explored in [1] but ...
متن کاملGeneralized Innermost Rewriting
We propose two generalizations of innermost rewriting for which we prove that termination of innermost rewriting is equivalent to termination of generalized innermost rewriting. As a consequence, by rewriting in an arbitrary TRS certain non-innermost steps may be allowed by which the termination behavior and efficiency is often much better, but never worse than by only doing innermost rewriting.
متن کاملOn the Trivial Many Sorted Algebras and Many Sorted Congruences
In this paper a, I denote sets and S denotes a non empty non void many sorted signature. The scheme MSSExD deals with a non empty set A and a binary predicate P , and states that: There exists a many sorted set f indexed by A such that for every element i of A holds P [i, f (i)] provided the following condition is met: • For every element i of A there exists a set j such that P [i, j]. Let I be...
متن کاملReachability Analysis of Innermost Rewriting
We consider the problem of inferring a grammar describing the output of a functional program given a grammar describing its input. Solutions to this problem are helpful for detecting bugs or proving safety properties of functional programs, and several rewriting tools exist for solving this problem. However, known grammar inference techniques are not able to take evaluation strategies of the pr...
متن کاملNotes on Many-Sorted Logic
Preface, p. vii Any reasonable logical system can be naturally translated into many-sorted first-order logic; thus many-sorted first-order logic is a universal logic. Since many-sorted logic can be translated into single-sorted first-order logic the latter is also universal. However, as will be seen in the course of this book, many-sorted logic faithfully interprets the semantics of the object ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2023
ISSN: ['1872-7964', '0167-6423']
DOI: https://doi.org/10.1016/j.scico.2022.102910